A Variable Group Parallel Flexible Job Shop Scheduling in a SMEs Manufacturing Platform

Manufacturing is a broad field with different types of production processes. Therefore, specific processes can accommodate multiple parallel machines operating simultaneously in some environments. This assumption particularly crucial factory scheduling for industries such as textile, aircraft, and semiconductor manufacturing. The proposed this paper differ from FJSP that they are closer to the real world by allowing perform same In paper, new approach solving flexible job shop problem has been proposed, which referred machine environment variable group. We hybrid genetic algorithm-based neighborhood search algorithm (GA-VNS) solve problem, where operate operations grouped GA-VNS combines global searching ability GA local VNS fully reflect condition groups. objective functions minimize makespan improve facility usage. Multiple simulation experiments conducted using forty-seven test instances assess feasibility effectiveness approach. study expected reduce processing time costs Small Medium Enterprises (SMEs) low cost high efficiency compared existing systems, manufacturing execution system, enterprise resource planning, system.